// Sieve of Eurathsphen - Finding Prime numbers#include<stdio.h>int array[1001];void bubbleSort (int * array, int n);int main () {        int i,N;        scanf("%d", &N);        for ( i = 0 ; i < N ; i++ ){        scanf("%d", &array[i]);    }        bubbleSort (array, N);        for ( i = 0 ; i < N ; i++ ){        printf("%d ", array[i]);    }    printf("\n");}void bubbleSort (int* array, int n) {        int i, j ;    for (i = 0 ; i <= n ; i++) {        for (j = i+1 ; j <= n ; j++) {            if (array[i] < array[j]) {                array[i] = array[i]+array[j];                array[j] = array[i]-array[j];                array[i] = array[i]-array[j];            }        }    }    }